The Gabriel 'Triangle' Benchmark at Warp Speed
نویسنده
چکیده
We show how to speed up the Gabriel 'Triangle' Benchmark by more than two orders of magnitude (206 X faster than the Cray-1) on a Common Lisp system running on the 80860-based OKIstation, by using better programming techniques. The resulting program fits nicely within next generation on-chip caches and kills almost all potential parallelism, thus becoming worthless as a general-purpose Lisp benchmark.
منابع مشابه
On Rolling Back and Checkpointing in Time Warp
ÐIn this paper, we present a family of three algorithms which serve to perform checkpoints and to roll back Time Warp. These algorithms are primarily intended for use in simulations in which there are a large number of LPs and in which events have a small computational granularity. Important representatives of this class are VLSI and computer network simulations. In each of our algorithms, LPs ...
متن کامل3D warp brush modeling
We introduce 3D warp brush, a new method for interactive shape modeling in an immersive virtual reality environment. 3D warp brushes are implicitly defined tools that operate on triangle meshes. We combine the efficiency of explicit mesh representations with intuitive implicit modeling operators. The area of influence of a 3D warp brush can be of arbitrary shape since it has an associated dista...
متن کاملiWarp: An Integrated Solution to High-Speed Parallel Computing
An iWarp component connected to a local memory forms Abstract an iWarp cell; up to 64 MBytes of memory are directly addressable. A large array of iWarp cells will deliver an iWarp is a system architecture for high speed signal, image enormous computing bandwidth never before realized in disand scientific computing. The heart of an iWarp system is the iWarp component: a single chip processor tha...
متن کاملAn Architecture for Hierarchical Collision Detection
We present novel algorithms for efficient hierarchical collision detection and propose a hardware architecture for a single-chip accelerator. We use a hierarchy of bounding volumes defined by k-DOPs for maximum performance. A new hierarchy traversal algorithm and an optimized triangle-triangle intersection test reduce bandwidth and computation costs. The resulting hardware architecture can proc...
متن کاملHigh-Performance Collision Detection Hardware
We present a novel hardware architecture for a single-chip collision detection accelerator and algorithms for efficient hierarchical collision. We use a hierarchy of k-DOPs for maximum performance. A new hierarchy traversal algorithm and an optimized triangle-triangle intersection test reduce bandwidth and computational costs. The resulting hardware architecture can process two object hierarchi...
متن کامل